On the mean subtree order of trees under edge contraction

نویسندگان

چکیده

For a tree T $T$ , the mean subtree order of is average . In 1984, Jamison conjectured that decreases by at least 1/3 after contracting an edge in this article we prove conjecture special case contracted pendant edge. From result, have new proof established fact path P n ${P}_{n}$ has minimum among all trees $n$ Moreover, sharp lower bound derived for difference between orders and proper S $S$ (of ), which also used to determine with second-smallest

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Maximum-Mean Subtree

In this paper, we define the Maximum-Mean Subtree problem on trees, an equivalent reformulation of the Fractional Prize-Collecting Steiner Tree Problem on Trees. We describe an algorithm that solves the Maximum-Mean Subtree problem, and prove that our algorithm runs in O(n) time in the worst case, improving a previous O(n log n) algorithm. 1 The Maximum-Mean Subtree Problem Given a rooted tree ...

متن کامل

The Subtree Size Profile of Bucket Recursive Trees

Kazemi (2014) introduced a new version of bucket recursive trees as another generalization of recursive trees where buckets have variable capacities. In this paper, we get the $p$-th factorial moments of the random variable $S_{n,1}$ which counts the number of subtrees size-1 profile (leaves) and show a phase change of this random variable. These can be obtained by solving a first order partial...

متن کامل

The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems

We consider problems in which we are given a rooted tree as input, and must find a subtree with the same root, optimizing some objective function of the nodes in the subtree. When this function is the sum of constant node weights, the problem is trivially solved in linear time. When the objective is the sum of weights that are linear functions of a parameter, we show how to list all optima for ...

متن کامل

Reconstructing trees from subtree weights

The tree-metric theorem provides a necessary and sufficient condition for a dissimilarity matrix to be a tree metric, and has served as the foundation for numerous distance-based reconstruction methods in phylogenetics. Our main result is an extension of the tree-metric theorem to more general dissimilarity maps. In particular, we show that a tree with n leaves is reconstructible from the weigh...

متن کامل

On the Maximum Common Embedded Subtree Problem for Ordered Trees

The maximum common embedded subtree problem, which generalizes the minor containment problem on trees, is reduced for ordered trees to a variant of the longest common subsequence problem. While the maximum common embedded subtree problem is known to be APX-hard for unordered trees, an exact solution for ordered trees can be found in polynomial time. In this paper, the longest common balanced se...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Graph Theory

سال: 2022

ISSN: ['0364-9024', '1097-0118']

DOI: https://doi.org/10.1002/jgt.22885